Proof Nets, Coends and the Yoneda Isomorphism

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polarized Proof-Nets: Proof-Nets for LC

We deene a notion of polarization in linear logic (LL) coming from the polarities of Jean-Yves Girard's classical sequent calculus LC 4]. This allows us to deene a translation between the two systems. Then we study the application of this polarization constraint to proof-nets for full linear logic described in 7]. This yields an important simpli-cation of the correctness criterion for polarized...

متن کامل

L-Nets, Strategies and Proof-Nets

We consider the setting of L-nets, recently introduced by Faggian and Maurel as a game model of concurrent interaction and based on Girard’s Ludics. We show how L-nets satisfying an additional condition, which we call logical L-nets, can be sequentialized into traditional tree-like strategies, and vice-versa.

متن کامل

Proof-Nets And Dependencies

Proof-Nets (Roorda 1990) are a good device for processing with eategorial grammars, mainly because they avoid spurious ambiguities. Nevertheless, they do not provide easily readable structures and they hide the true proximity between Categorial Grammars and Dependency Grammars. We give here an other kind of Proof-Nets which is much related to Dependency Structures similar to those we meet in, f...

متن کامل

Polarized Proof - Nets : Proof - Nets for LC ( Extended

We deene a notion of polarization in linear logic (LL) coming from the polarities of Jean-Yves Girard's classical sequent calculus LC 4]. This allows us to deene a translation between the two systems. Then we study the application of this polarization constraint to proof-nets for full linear logic described in 7]. This yields an important simpli-cation of the correctness criterion for polarized...

متن کامل

Lexicalized Proof-Nets and TAGs

First introduced by [Ret93], pomset linear logic can deal with linguistic aspects by inducing a partial order on words. [LR95] uses this property: it defines modules (or partial proof-nets) which consist in entries for words, describing both the category of the word and its behavior when interacting with other words. Then the natural question of comparing the generative power of such grammars w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science

سال: 2019

ISSN: 2075-2180

DOI: 10.4204/eptcs.292.9